Abstract: Block A* and Any-Angle Path-Planning
نویسندگان
چکیده
Block A* and Any-angle Path-Planning Peter Yap and Neil Burch and Robert C. Holte and Jonathan Schaeffer Computing Science Department University of Alberta Edmonton, Alberta, Canada T6G 2E8 [email protected], {nburch, rholte, jonathan}@ualberta.ca
منابع مشابه
Block A*: Database-Driven Search with Applications in Any-Angle Path-Planning
We present three new ideas for grid-based path-planning algorithms that improve the search speed and quality of the paths found. First, we introduce a new type of database, the Local Distance Database (LDDB), that contains distances between boundary points of a local neighborhood. Second, an LDDB-based algorithm is introduced, called Block A*, that calculates the optimal path between start and ...
متن کاملAny-Angle Path Planning for Computer Games
Path planning is a critical part of modern computer games; rare is the game where nothing moves and path planning is not necessary. A* is the workhorse for most path planning applications. Block A* is a state-of-the-art algorithm that is always faster than A* in experiments using game maps. Unlike other methods that improve upon A*’s performance, Block A* does not require knowledge of the map b...
متن کاملSpeeding-Up Any-Angle Path-Planning on Grids
Simple Subgoal Graphs are constructed from grids by placing subgoals at the corners of obstacles and connecting them. They are analogous to visibility graphs for continuous terrain but have fewer edges and can be used to quickly find shortest paths on grids. The vertices of a Simple Subgoal Graph can be partitioned into different levels to create N-Level Subgoal Graphs, which can be used to fin...
متن کاملAny-Angle Path Planning
In robotics and video games, one often discretizes continuous terrain into a grid with blocked and unblocked grid cells and then uses path-planning algorithms to find a shortest path on the resulting grid graph. This path, however, is typically not a shortest path in the continuous terrain. In this overview article, we discuss a path-planning methodology for quickly finding paths in continuous ...
متن کاملAn Empirical Comparison of Any-Angle Path-Planning Algorithms
We compare five any-angle path-planning algorithms, Theta*, Block A*, Field D*, ANYA, and Any-Angle Subgoal Graphs in terms of solution quality and runtime. Anyangle path-planning is a fairly new research area, and no direct comparison exists between these algorithms. We implement each algorithm from scratch and use similar implementations to provide a fair comparison. Introduction For path pla...
متن کامل